Towards a unified theory of logic programming semantics: Level mapping characterizations of disjunctive stable models

نویسندگان

  • Pascal Hitzler
  • Matthias Knorr
چکیده

Currently, the variety of expressive extensions and different semantics created for logic programs with negation is diverse and heterogeneous, and there is a lack of comprehensive comparative studies which map out the multitude of perspectives in a uniform way. Most recently, however, a new methodology has been proposed which allows one to derive uniform characterizations of different declarative semantics for logic programs with negation. We will extend these studies by a result which characterizes stable models for disjunctive logic programs in the sense mapped out by the unifying methodology.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards a unified theory of logic programming semantics: Level mapping characterizations of selector generated models

Currently, the variety of expressive extensions and different semantics created for logic programs with negation is diverse and heterogeneous, and there is a lack of comprehensive comparative studies which map out the multitude of perspectives in a uniform way. Most recently, however, new methodologies have been proposed which allow one to derive uniform characterizations of different declarati...

متن کامل

Level mapping characterizations for quantitative and disjunctive logic programs

Several different approaches of logic programming semantics have been proposed during the last two decades. These semantics varied in many aspects and it was difficult to find the exact relationships between them. Hitzler and Wendt proposed a new method, based on level mappings, which allows to provide uniform characterizations of different semantics for logic programs. They gave new characteri...

متن کامل

Characterizations of the Stable Semanticsby Partial

There are three most prominent semantics deened for certain subclasses of disjunctive logic programs: GCWA (for positive programs), PERFECT (for stratiied programs) and STABLE (deened for the whole class of all disjunctive programs). While there are various competitors based on 3-valued models, notably WFS and its disjunctive counterparts, there are no other semantics consisting of 2-valued mod...

متن کامل

Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics

In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for such programs. We show that many-valued disjunctive logic programs under the semantics of minimal models, perfect models, stable models, and least model states can be unfolded to equivalent classical disjunctive logic pr...

متن کامل

Semantics for Disjunctive Logic Programs with Explicit and Default Negation

The use of explicit negation enhances the expressive power of logic programs by providing a natural and unambiguous way to assert negated information about the domain being represented. We study the semantics of disjunctive programs that contain both explicit negation and negation-by-default, called extended disjunctive logic programs. General techniques are described for extending model, xpoin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005